Fortunately, the whole discussion of overflows does not apply to the hash index that I implemented. 幸运的是,针对溢出的全部讨论不会出现在我所实现的hash索引。
Forest of Trees indexes combine many of the advantages of a hash index with those of a traditional Informix B+ tree index. ForestofTrees索引结合了hash索引和传统InformixB+tree索引的许多优势。
This article uses a rather basic hash index as an example. 本文使用一个非常基本的hash索引作为例子。
Those details are not discussed here; instead this article describes the general idea and its adaptation to integrate a hash index into a database system using the DB2 index extension mechanism. 本文并不讨论这些细节,而是描述一般的思想,以及使用DB2索引扩展机制将hash索引集成到数据库系统中。
As before with the hash index, you need to define a key generator UDF, a range producer UDF, the index extension, and finally a UDF that exploits the index extension if possible. 与hash索引一样,这里需要定义一个键生成器UDF、一个范围生成器UDF、一个索引扩展以及一个利用索引扩展的UDF。
Access plan for query without hash Index 不使用hash索引的查询的访问计划
The various hash index methods are intended to address different aspects of the hashing itself, like the handling of collisions or overflows. 不同的hash索引方法用于解决hash本身的不同方面,例如处理冲突或溢出。
Thus, the search in a large file using a hash index is faster than scanning the entire file. 因此,对于较大的文件,使用hash索引进行搜索比扫描整个文件更快。
All numeric hash values are stored using the index extension in the DB2-internal B-Tree index. 所有数值型hash值都使用DB2内部的B-树索引中的索引扩展来存储。
With a hash index you can find a record in a given file in constant time by generating a hash value for the record and then looking up the record in the file based on that hash value. 借助hash索引,可以通过为记录生成一个hash值,然后根据这个hash值在文件中查找该记录,从而在固定的时间内在给定的文件中找到一条记录。
Thus, all indexed strings with the same hash code are returned from the index scan as possible candidates. 因此,索引扫描返回所有具有相同hash码的已索引的字符串,作为可能的候选者。
Hash& Tree Tree: Cache Conscious Index of Memory Database HT树:缓存敏感的内存数据库索引
Hash index model is to check the index data and create the bitmap index of the index data. 哈希索引亡储模式从要非判续索引数据非否亡反在,树立索引数据的位图索引。
The index storage models of the hybrid index mechanism have three models: tree model, hash index model and inverted file model. 混纯索引机造采取的索引亡储模型从要无树、哈希和反排文件三类方式。
Design and Implementation of a hash Algorithm that Applies to URL Index in Search Engine 一种应用于搜索引擎URL检索的hash算法设计与实现
This method uses a pre-computed hash table to serve as an index for short sequences. 这一方法利用一个预先计算的哈西表作为短序列的索引。
Total amount of memory granted to executing processes. This memory is used for hash, sort and create index operations. 授权允许执行进程的内存总量。此内存用于哈希、排序和创建索引操作。
A PRA-tree is supplemented by a hash index on leaf nodes, and uses bottom-up delete algorithm, thus having a good update performance and concurrency. PRA树索引增加了一个建于叶节点之上的Hash辅助索引结构,并采用自底向上的删除搜索算法,具有很好的动态性能和并发性。
The algorithm uses a sequence hash index with n-gram to speed the fault tolerance query processing. 此算法采用n-gram的顺序hash索引,加快了可容错的查询处理速度。
After introducing the organization form of the memory database, it focuses on the HASH arithmetic of index and protection of integrity and consistence of the data. 在介绍了内存数据库的组织形式之后,本文重点分析了索引HASH算法以及数据完整性和一致性保护。
This method adopts a physical storage mode based on memory page and a logical organization manner based on Hash Table and T-tree index. It can be used to build MMDB ( Main Memory Data Base) in the embedded system. 该方式采用基于内存页的物理存储方法和基于Hash表与T-树索引的逻辑组织方法,适用于在嵌入式系统中构建基于内存的关系型数据库。
It mixes the dynamic and static methods to distribute the metadata in the MDS cluster, uses hash technology to index metadata and employs share common storage space to store the metadata. 它混合了动态和静态的方法在MDS机群中分布元数据,并使用散列的技术索引元数据,利用共享存储来存放元数据。
Broadcast index consists of tree index, hash index, hybrid index. 索引技术可分为树索引、哈希索引和混合索引。
This paper describes the Hash index algorithm, gives the data performance test data, and has a contrast with T-Tree index and Hash index. 介绍了内存数据管理系统使用的哈希索引算法,并给出了性能测试数据,与T树索引做一个对比。
This storage engine mainly includes storage engine interface, parallel batch linear hash index module and disk buffer. 此引擎中主要包含存储引擎接口、并行批量线性Hash索引模块、磁盘存储缓冲等部分。
Based information entropy, multi-precision similarity matching and multi-dimension hash index are proposed. 提出了基于信息熵的多精度相似匹配和多维散列索引技术。
By using the methods of graph encoding and hash mapping, the dual index can support fast random access, and quick maintenance, and get matching set quickly by bi-direction search. 该方法结合图的编码技术和存储映射技术,支持索引的快速随机访问,其查询索引结构能够快速更新,并使用双向检索的方法快速查找匹配集合。
Using geographic coding identified by the Hash value to mark the region, and using the Hash value to index the list of users, terrain data, and model object data. 以Hash值标识为区域的地理编码,并以Hash值索引用户列表、地形数据、模型对象数据。
Relative address is needed for processes to access data which is stored in the shared memory. This design uses hash index to improve the speed of data query and chooses list to deal with the conflict and to reduce the average time of searching. 本设计采用哈希索引方式加快数据检索的速度,并选择链地址法处理冲突,降低平均查找时间。
Reasonable index mechanism can greatly improve the performance of database, this paper designs a B+-HASH tree index structure, and presents the mathematical definition of index. 合理的索引机制能够大大地提高数据库性能,本文设计出了B+-HASHtree索引结构,并给出了该索引的数学定义。